Universal Derivations 1.0, A Growing Collection of Harmonised Word-Formation Resources
نویسندگان
چکیده
منابع مشابه
Growing resources
Botanical gardens have been assembling collections of data on local computer networks for some time, but access to these databases via the internet is a more recent innovation. For a look at some of the latest trends in online botanical-garden resources, check out the Royal Botanic Garden Edinburgh (RBGE). The RBGE’s searchable data sets lead visitors to the Araliales Resource Centre, which pro...
متن کاملWord Formation and the Validation of Lexical Resources
In the framework of Word Manager (WM), morphological dictionaries are produced by the classification of lexemes in terms of a rule database. The intricate structure of the resulting lexical resources, conceived primarily for flexible use, also offers novel opportunities for the validation of the lexical specification. Many of the inconsistencies and errors encountered in lexical specification i...
متن کاملassessment of deep word knowledge in elementary and advanced iranian efl learners: a comparison of selective and productive wat tasks
testing plays a vital role in any language teaching program. it allows teachers and stakeholders, including program administrators, parents, admissions officers and prospective employers to be assured that the learners are progressing according to an accepted standard (douglas, 2010). the problems currently facing language testers have both practical and theoretical implications but the first i...
Universal Dependencies v1: A Multilingual Treebank Collection
Cross-linguistically consistent annotation is necessary for sound comparative evaluation and cross-lingual learning experiments. It is also useful for multilingual system development and comparative linguistic studies. Universal Dependencies is an open community effort to create cross-linguistically consistent treebank annotation for many languages within a dependency-based lexicalist framework...
متن کاملPlacing Resources on a Growing Line
We consider the problem of placing k identical resources in a graph where each vertex is associated with a nonnegative weight representing the frequency of requests issued by that vertex for the resource. We de ne the cost of a placement as the sum over all vertices of their distances to the closest resource weighted by their weights. The optimal placement is the placement with least cost among...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Prague Bulletin of Mathematical Linguistics
سال: 2020
ISSN: 1804-0462,0032-6585
DOI: 10.14712/00326585.003